On the upper Lipschitz property of the KKT mapping for nonlinear semidefinite optimization
نویسندگان
چکیده
In this note, we prove that the KKT mapping for nonlinear semidefinite optimization problem is upper Lipschitz continuous at the KKT point, under the second-order sufficient optimality conditions and the strict Robinson constraint qualification.
منابع مشابه
On Metric Regularity for Weakly Almost Piecewise Smooth Functions and Some Applications in Nonlinear Semidefinite Programming
The one-to-one relation between the points fulfilling the KKT conditions of an optimization problem and the zeros of the corresponding Kojima function is well-known. In the present paper we study the interplay between metric regularity and strong regularity of this a priori nonsmooth function in the context of semidefinite programming. Having in mind the topological structure of the positive se...
متن کاملA note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems
We prove a new local upper Lipschitz stability result and the associated local error bound for solutions of parametric Karush–Kuhn–Tucker systems corresponding to variational problems with Lipschitzian base mappings and constraints possessing Lipschitzian derivatives, and without any constraint qualifications. This property is equivalent to the appropriately extended to this nonsmooth setting n...
متن کاملProto-derivatives and the Geometry of Solution Mappings in Nonlinear Programming
We quantify the sensitivity of KKT pairs associated with a parameterized family of nonlinear programming problems. Our approach involves proto-derivatives, which are generalized derivatives appropriate even in cases when the KKT pairs are not unique; we investigate what the theory of such derivatives yields in the special case when the KKT pairs are unique (locally). We demonstrate that the gra...
متن کاملA path following interior-point algorithm for semidefinite optimization problem based on new kernel function
In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...
متن کاملOn the duality of quadratic minimization problems using pseudo inverses
In this paper we consider the minimization of a positive semidefinite quadratic form, having a singular corresponding matrix $H$. We state the dual formulation of the original problem and treat both problems only using the vectors $x in mathcal{N}(H)^perp$ instead of the classical approach of convex optimization techniques such as the null space method. Given this approach and based on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 44 شماره
صفحات -
تاریخ انتشار 2016